Matrix Clock Synchronization in the Distributed Computing Environment
نویسندگان
چکیده
Matrix clock is a generalisation of the notion of vector clock. Matrix clock is a mechanism for capturing chronological and causal relationship in a Distributed system. Matrix clock is a list of vector clocks, and it also contains the current state of each node in the system. On the basis of this it know which peer received already which messages. When it exchanges messages with another node in the system then it compare the matrix clocks and remember always the highest values for each node. After retrieve back information of node it delete messages which were sent before, it considered that the node already have received them. Matrix clock allows establishing a lower bound on what other hosts know, and is useful in applications such as check pointing and garbage collection. KeywordsDistributed computing, Vector clock, Matrix clock, Event ordering, Clock synchronization, Logical clock.
منابع مشابه
Linear matrix inequality approach for synchronization of chaotic fuzzy cellular neural networks with discrete and unbounded distributed delays based on sampled-data control
In this paper, linear matrix inequality (LMI) approach for synchronization of chaotic fuzzy cellular neural networks (FCNNs) with discrete and unbounded distributed delays based on sampled-data controlis investigated. Lyapunov-Krasovskii functional combining with the input delay approach as well as the free-weighting matrix approach are employed to derive several sufficient criteria in terms of...
متن کاملFault-Tolerant Clock Synchronization in Environments with High Message Delay Variation
| Fault-tolerant clock synchronization is an important requirement in many distributed systems, especially in time-critical and safety-critical applications. Frequently, interactive convergence algorithms are used for fault-tolerant clock synchronization, providing advantages such as fully-distributed operation, low message exchange overhead and simplicity of implementation. This paper presents...
متن کاملBlock Matrix Multiplication in a Distributed Computing Environment: Experiments with NetSolve
We address synchronization issues of some block matrix multiplication algorithms in a distributed computing environment. We discuss performance behavior of a client/server implementation of these algorithms focusing on the most appropriate version which delivers the minimum synchronization overhead. Numerical experiments are carried out using the NetSolve distributed computing system.
متن کاملFault-tolerant Clock Synchronization for Distributed Systems with High Message Delay Variation
Fault-tolerant clock synchronization is an important requirement in many distributed systems , especially in time-critical and safety-critical applications. Frequently, interactive convergence algorithms are used for fault-tolerant clock synchronization, providing advantages such as fully distributed operation, low message exchange overhead, and simplicity of implementation. This paper presents...
متن کاملOptimal Deterministic Remote Clock Estimation in Real-Time Systems
In an OPODIS’06 paper, we laid down the foundations of a real-time distributed computing model (RT-Model) with non-zero duration computing steps, which reconciles correctness proofs and realtime schedulability analysis of distributed algorithms. By applying the RT-Model to the well-known drift-free internal clock synchronization problem, we proved that classic zero step-time analysis sometimes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015